A Robust Approach for the Airport Gate Assignment

نویسندگان

  • Liang Xu
  • Fan Wang
چکیده

Airport gate assignment is a critical issue for the operation management of an airport. Airport gate assignment is to assign flights to gates according to their real-time arrival time and departure time, such that each flight is assigned to exactly one gate, and there is no conflict between two consecutive flights assigned to the same gate. We formulate the airport gate assignment as a stochastic binary integer programming, in which the realtime arrival and departure time are stochastic parameters. Concerning the real-time flight disturbance, a robust approach is introduced to protect the airport gate assignment from flight disturbance such as flight delay or early arrival. Instead of making strong assumption on the distribution of the real-time arrival and departure time of a flight, we assume that they belong to pre-specified uncertainty sets. The robust approach is to make sure that the airport gate assignment is feasible for all possible value for the real-time arrival and departure time within their uncertainty sets. Under these uncertainty sets, we can transform the stochastic binary integer programming to a mix integer programming. The computational results on the real-life test data from Hong Kong International Airport demonstrate that our robust approach can avoid realtime gate conflict efficiently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty

Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...

متن کامل

Numerical Analysis of Gate Conflict Duration and Passenger Transit Time in Airport

Robustness is as important as efficiency in air transportation. All components in the air traffic system are connected to form an interactive network. So, a disturbance that occurs in one component, for example, a severe delay at an airport, can influence the entire network. Delays are easily propagated between flights through gates, but the propagation can be reduced if gate assignments are ro...

متن کامل

Airport Gate Assignments Model and Algorithm

Airport gate assignment is to appoint a gate for the arrival or leave flight and to ensure that the flight is on schedule. Assigning the airport gate with high efficiency is a key task among the airport ground busywork. As the core of airport operation, aircraft gate assignment is known as a kind of complicated combinatorial optimization problem. This paper proposed robust assignment model to m...

متن کامل

A Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms

Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this res...

متن کامل

Time-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem

Many disturbances can impact gate assignments in daily operations of an airport. Gate Assignment Problem (GAP) is the main task of an airport to ensure smooth flight-to-Gate assignment managing all disturbances. Or, flights schedule often undergoes some unplanned disruptions, such as weather conditions, gate availability or simply a delay that usually arises. A good plan to GAP should manage as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011